MSO satisfaction is FPT on
نویسنده
چکیده
There is a computable function f such that the problem of deciding, given a word w and an MSO sentence φ whether, S w |= φ can be decided in time O(f (l)n) where l is the length of φ and n is the length of w.
منابع مشابه
Parameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of vertices W such that G \W satisfies property π. Typically, we want to minimize size of the deletion set W . Unlike this, in fair vertex deletion problems we change the objective: we minimize the maximum number of vertices deleted in neighborhood of any vertex. When the property π is ...
متن کاملParameterized Complexity of Fair Deletion Problems
Edge deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of edges such that after its removal the graph G will satisfy the property π. Typically, we want to minimize the number of edges removed. In fair deletion problem we change the objective: we minimize the maximum number of edges incident to a single vertex. We study the parameterized compl...
متن کاملParameterized Shifted Combinatorial Optimization
Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems. In particular, every standard combinatorial optim...
متن کاملFly-automata, model-checking and recognizability
The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based. Recognizability is an algebraic notion, defined in terms of congruences that can also be formulated by means of finite automata on the terms that describe the conside...
متن کاملIterative Plan Construction for the Workflow Satisfiability Problem
The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan – an assignment of tasks to authorized users – such that all constraints are satisfied. It is natural to see the WSP as a subclass of the Constrain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011